An efficient simulation for quantum secure multiparty computation
نویسندگان
چکیده
منابع مشابه
Broadcast-Efficient Secure Multiparty Computation
Secure multiparty computation (MPC) is perhaps the most popular paradigm in the area of cryptographic protocols. It allows several mutually untrustworthy parties to jointly compute a function of their private inputs, without revealing to each other information about those inputs. In the case of unconditional (information-theoretic) security, protocols are known which tolerate a dishonest minori...
متن کاملEfficient Maliciously Secure Multiparty Computation for RAM
A crucial issue, that mostly affects the performance of actively secure computation of RAM programs, is the task of reading/writing from/to memory in a private and authenticated manner. Previous works in the active security and multiparty settings are based purely on the SPDZ (reactive) protocol, hence, memory accesses are treated just like any input to the computation. However, a garbled-circu...
متن کاملRound Efficient Unconditionally Secure Multiparty Computation Protocol
In this paper, we propose a round efficient unconditionally secure multiparty computation (UMPC) protocol in information theoretic model with n > 2t players, in the absence of any physical broadcast channel, which communicates O(n4) field elements per multiplication and requires O(n log(n) + D) rounds, even if up to t players are under the control of an active adversary having unbounded computi...
متن کاملEfficient Secure Multiparty Computation with Identifiable Abort
We study secure multiparty computation (MPC) in the dishonest majority setting providing security with identifiable abort, where if the protocol aborts, the honest parties can agree upon the identity of a corrupt party. All known constructions that achieve this notion require expensive zeroknowledge techniques to obtain active security, so are not practical. In this work, we present the first e...
متن کاملSecure Multiparty Quantum Computation for Summation and Multiplication
As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to secu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2021
ISSN: 2045-2322
DOI: 10.1038/s41598-021-81799-z